| 翻訳と辞書 |
| prediction by partial matching ： ウィキペディア英語版 |
prediction by partial matching
Prediction by partial matching (PPM) is an adaptive statistical data compression technique based on context modeling and prediction. PPM models use a set of previous symbols in the uncompressed symbol stream to predict the next symbol in the stream. PPM algorithms can also be used to cluster data into predicted groupings in cluster analysis.
== Theory ==
Predictions are usually reduced to symbol rankings. The number of previous symbols, ''n'', determines the order of the PPM model which is denoted as PPM(''n''). Unbounded variants where the context has no length limitations also exist and are denoted as ''PPM
*''. If no prediction can be made based on all ''n'' context symbols a prediction is attempted with ''n'' − 1 symbols. This process is repeated until a match is found or no more symbols remain in context. At that point a fixed prediction is made.
Much of the work in optimizing a PPM model is handling inputs that have not already occurred in the input stream. The obvious way to handle them is to create a "never-seen" symbol which triggers the escape sequence. But what probability should be assigned to a symbol that has never been seen? This is called the zero-frequency problem. One variant uses the Laplace estimator, which assigns the "never-seen" symbol a fixed pseudocount of one. A variant called PPMD increments the pseudocount of the "never-seen" symbol every time the "never-seen" symbol is used. (In other words, PPMD estimates the probability of a new symbol as the ratio of the number of unique symbols to the total number of symbols observed).
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「prediction by partial matching」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|